Handling Fluorescence in a Uni-directional Spectral Path Tracer

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uni-directional links in routing

A number of network configurations, in which pairs of nodes are connected by uni-directional links (UDLs), is increasing. For the QoS related reasons, it may be also advantageous to assume that a bi-directional link (BDL) is a set of two unidirectional links. Current routing protocols are designed for networks where all links are bi-directional. They fail to perform in networks with UDLs theref...

متن کامل

A Framework for MPLS Path Setup in Uni-Directional Multicast Shared Trees

Establishing multicast communications in MPLS-capable networks is an essential requirement for a wide-scale deployment of MPLS in the Internet. This paper outlines a framework for the setup of a MultiPoint-to-MultiPoint (MP2MP) Label Switched Path (LSP) for establishing uni-directional multicast shared trees. The presented framework is intended for multicast applications within a single autonom...

متن کامل

Design of a Uni-Directional MultiRing Switch

MultiRing is a network of 2 nodes which can be configured into different ring networks of n different configurations. It supports a wide variety of algorithms, such as algorithms for parallel image processing. In this paper, a MultiRing is implemented using a star topology with a MultiRing switch at the centre. We present a hierarchical design of the MultiRing switch. We demonstrate that the co...

متن کامل

Uni-directional Alternating Group Graphs

A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one ...

متن کامل

Forward-only uni-directional routing

Wireless computer networks have properties that differ significantly from traditional wireline networks. One prominent difference is the presence of unidirectional channels. That is, it may be possible for a computer p to send a message to a neighboring computer q, but it may not be possible for computer q to send a message to computer p. This introduces significant changes in routing protocols...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Graphics Forum

سال: 2018

ISSN: 0167-7055

DOI: 10.1111/cgf.13477